Uncertainty quantification for data-driven turbulence modelling with Mondrian forests

نویسندگان

چکیده

Data-driven turbulence modelling approaches are gaining increasing interest from the CFD community. However, introduction of a machine learning (ML) model introduces new source uncertainty, ML itself. Quantification this uncertainty is essential since predictive capability data-driven diminishes when predicting physics not seen during training. In work, we explore suitability Mondrian forests (MF's) for modelling. MF's claimed to possess many advantages commonly used random forest (RF) algorithm, whilst offering principled estimates. An example test case constructed, with anisotropy constant derived high fidelity resolving simulations. Shapley values, borrowed game theory, interpret MF predictions. Predictive found be large in regions where training data representative. Additionally, exhibit stronger correlation errors compared an priori statistical distance measure, which indicates it better measure prediction confidence. The also calibrated and less computationally costly than estimated applying jackknifing Finally, predict Reynolds discrepancies convergent-divergent channel, subsequently propagated through modified solver. resulting flowfield predictions close agreement data. A procedure sampling forests' uncertainties introduced. Propagating these samples enables quantification output quantities interest.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mondrian Forests for Large-Scale Regression when Uncertainty Matters

Many real-world regression problems demand a measure of the uncertainty associated with each prediction. Standard decision forests deliver efficient state-of-the-art predictive performance, but high-quality uncertainty estimates are lacking. Gaussian processes (GPs) deliver uncertainty estimates, but scaling GPs to large-scale data sets comes at the cost of approximating the uncertainty estimat...

متن کامل

Mondrian Forests: Efficient Online Random Forests

Ensembles of randomized decision trees, usually referred to as random forests, are widely used for classification and regression tasks in machine learning and statistics. Random forests achieve competitive predictive performance and are computationally efficient to train and test, making them excellent candidates for real-world prediction tasks. The most popular random forest variants (such as ...

متن کامل

Data-driven uncertainty quantification using the arbitrary polynomial chaos expansion

We discuss the arbitrary polynomial chaos (aPC), which has been subject of research in a few recent theoretical papers. Like all polynomial chaos expansion techniques, aPC approximates the dependence of simulation model output on model parameters by expansion in an orthogonal polynomial basis. The aPC generalizes chaos expansion techniques towards arbitrary distributions with arbitrary probabil...

متن کامل

Uncertainty Quantification in Flight Dynamics Modelling

The modelling of dynamic effects for flight dynamics analysis typically makes use of dynamic derivatives. A single value for the derivative is used and is assumed to be independent of the conditions for which it is calculated. This is however not the case. This work looks to quantify the uncertainty introduced as a result for an arbitrary manoeuvre within the flight envelope. The manoeuvres can...

متن کامل

Universal consistency and minimax rates for online Mondrian Forests

We establish the consistency of an algorithm of Mondrian Forest [LRT14, LRT16], a randomized classification algorithm that can be implemented online. First, we amend the original Mondrian Forest algorithm proposed in [LRT14], that considers a fixed lifetime parameter. Indeed, the fact that this parameter is fixed actually hinders statistical consistency of the original procedure. Our modified M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2021

ISSN: ['1090-2716', '0021-9991']

DOI: https://doi.org/10.1016/j.jcp.2021.110116